Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - 1024 FFT

Search list

[Algorithm] FFT1

Description: 基于Danielson Lanczos算法 1024点FFT运算-Danielson Lanczos algorithm for fft
Platform: | Size: 1024 | Author: ogrex | Hits:

[VHDL-FPGA-Verilog] FFT2

Description: 适用于NIOS II的1024点FFT C算法- 1024-point FFT C algorithm for NIOS II
Platform: | Size: 2048 | Author: ogrex | Hits:

[SCM] fft_1024

Description: 1024点的FFT变换，很实用，用于单片机做快速傅立叶变换-1024-point FFT transform, it is practical, fast Fourier transform for the microcontroller to do
Platform: | Size: 63488 | Author: aguo | Hits:

[VHDL-FPGA-Verilog] fft_1024_hdl

Description: 1024点FFT快速傅立叶变换(vhdl)-1024 point FFT in the FPGA enviroment
Platform: | Size: 18432 | Author: zhanglili | Hits:

[VHDL-FPGA-Verilog] 7788

Description: 用verilog编写的1024点的fft快速傅立叶变换-Written in 1024 by verilog point fast Fourier transform fft
Platform: | Size: 12288 | Author: yangyang | Hits:

[DSP program] STM32F10x_DSP_Lib_V1.0.1

Description: STM32的DSP库，包括64点，256点，1024点FFT和PID控制算法-The STM32 DSP library, including 64 points, 256 points, 1024 points FFT and the PID control algorithm
Platform: | Size: 1980416 | Author: 王冲 | Hits:

[Algorithm] FFT1D

Description: FFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。 在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。 在运行结果中，只需存储左下角的1/4区域的数据即可。 -FFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: | Size: 153600 | Author: | Hits:

[Algorithm] FFT2D

Description: 2dFFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。 在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。 在运行结果中，只需存储左下角的1/4区域的数据即可。 -2dFFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: | Size: 525312 | Author: | Hits:

[VHDL-FPGA-Verilog] cf_fft_1024_8

Description: 1024点的fft算法verilog实现程序，主要是通过verilog来实现fft算法- 1024 spot fft algorithm verilog realizes the procedure
Platform: | Size: 11264 | Author: ALEX | Hits:

[Algorithm] test

Description: 1024点fft变换，最经典的蝶形运算方法！-1024-point fft transform, the most classical method of butterfly!
Platform: | Size: 206848 | Author: paddy | Hits:

[Special Effects] input_vec

Description: 用C生成1024点FFT输入的复数数据，并存在一个TXT文件中-1024-point FFT in C to generate complex input data, and there is a TXT file
Platform: | Size: 1024 | Author: | Hits:

[matlab] sim1024fft

Description: 基-2的1024点FFT算法，并与理论FFT结果比较，改程序是正确的.-1024-point radix-2 FFT algorithm, and compared with the theoretical results of the FFT, to change the program is correct.
Platform: | Size: 1024 | Author: 路程程 | Hits:

[SCM] myFFT

Description: 自己写的1024点FFT，旋转因子用常数表写入ROM里-1024 points FFT
Platform: | Size: 3072 | Author: dskfajk | Hits:

[VHDL-FPGA-Verilog] FFT1024

Description: FPGA的1024点的FFT算法程序，经过调试，程序移植性强。-1024-point FFT algorithm in the FPGA program, debugging, program portability.
Platform: | Size: 6457344 | Author: ctr | Hits:

[OS Develop] mabmbm

Description: F2812 标准FFT算法,128点,256点,512点,1024点FFT算法,具体做法为将库含数FFT.LIB加入的目标项目,加入对应的C含数和头文件,特别注意的FFT算法缓冲去一定要存放在0X8000H中的内部缓冲区中!!!切记,本人调试时就走了很多弯路啊-F2812 standard FFT algorithm, 128, 256, 512, 1024-point FFT algorithm, the specific approach to the library will join with several FFT.LIB goals, joined counterparts with the number of C header files, pay special attention to the FFT algorithm to buffer must 0X8000H stored in the internal buffer! ! ! remember, I debug away many detours ah
Platform: | Size: 2048 | Author: sss | Hits:

[SCM] main

Description: F2812 标准FFT算法,128点,256点,512点,1024点FFT算法,具体做法为将库含数FFT.LIB加入的目标项目,加入对应的C含数和头文件,特别注意的FFT算法缓冲去一定要存放在0X8000H中的内部缓冲区中!!!切记,本人调试时就走了很多弯路啊-F2812 standard FFT algorithm, 128 points, 256 points, 512 points, 1024 points FFT algorithm, and the specific practices for the library contains several FFT. LIB to join goal project, to join the corresponding C contains several and head files, pay special attention to must buffer FFT algorithm in 0 X8000H of internal buffer!!!!!!! Remember, I go a lot when debugging detour ah
Platform: | Size: 2048 | Author: 丁冠龙 | Hits:

[ARM-PowerPC-ColdFire-MIPS] TFT_FFT

Description: STM32 处理器FFT，1024点，效果不错-STM32 processor FFT, 1024 points, good results
Platform: | Size: 836608 | Author: Jimmy | Hits:

[assembly language] ee

Description: 快速傅立叶变换(FFT)是离散傅立叶变换的一种有效的算法，通过选择和重新排列中间结果，减小运算量。DFT有大量重复的cos、sin计算，FFT的作用就是用技巧减少cos、sin项重复计算。当采样点数为1024点,DFT要求一百万次以上计算量，而FFT则只要求一万次。-cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width
Platform: | Size: 1024 | Author: zz | Hits:

[Software Engineering] 000

Description: STM32 64 256 1024采集点的FFT算法结果作用意义!-STM32 64 256 1024 collection point FFT algorithm result role sense!
Platform: | Size: 19456 | Author: justy lee | Hits:

[VHDL-FPGA-Verilog] fft_1024

Description: 1024点FFT处理器，能通过quartusII验证通过-1024 point fft code,can pass the test of the software quartusII
Platform: | Size: 3072 | Author: 王喆 | Hits:
« 1 2 ... 5 6 7 8 9 1011 12 »

CodeBus www.codebus.net